On extending slicing floorplan to handle L/T-shaped modules andabutment constraints
نویسندگان
چکیده
In floorplanning, it is common that a designer wants to have certain modules abutting with one another in the final packing. The problem of controlling the relative positions of an arbitrary number of modules in floorplan design is nontrivial. Slicing floorplan has an advantageous feature in which the topological structure of the packing can be found without knowing the module dimensions. This feature is good for handling placement constraints in general. In this paper, we make use of it to solve the abutment problem in the presence of Land T-shaped modules. This is done by a procedure which explores the topological structure of the packing and finds the neighborhood relationship between every pair of modules in linear time. Our main contribution is a method that can handle abutment constraints in the presence of Lor T-shaped modules in such a way that the shape flexibility of the soft modules can still be fully exploited to obtain a tight packing. We tested our floorplanner with some benchmark data and the results are promising.
منابع مشابه
On extending slicing floorplans to handle L/T-shaped modules and abutment constraints
In oorplanning it is common that a designer wants to have certain modules abutting with one another in the nal pack ing Unfortunately few oorplanning algorithm can han dle abutment constraints although this feature is useful in practice The problem of controlling the relative positions of an arbitrary number of modules is non trivial Slicing oorplans have an advantageous feature that the topolo...
متن کاملSlicing floorplans with boundary constraints
In floorplanning of very large scale integration design, it is useful if users are allowed to specify some placement constraints in the packing. One particular kind of placement constraints is to pack some modules on one of the four sides: on the left, on the right, at the bottom, or at the top of the final floorplan. These are called boundary constraints. In this paper, we enhanced a well-know...
متن کاملSlicing floorplan with clustering constraint
In floorplan design it is useful to allow users to specify some placement constraints in the final packing. Clustering constraint is a popular type of placement constraint in which a given set of modules are restricted to be placed adjacent to one another. The wiring cost can be reduced by placing modules with a lot of interconnections closely together. Designers may also need this type of cons...
متن کاملOn accelerating slicing floorplan design with boundary constraints
Recently Young and Wong extended the well-known simulated annealing based Wong-Liu algorithm [ I ] to solve the problem of slicing floorplan design with boundary constraints. The main idea behind the Young-Wong algorithm [4] is to determine the boundary information of each module in a floorplan by traversing the corresponding normalized Polish expression from right to left once. By having caref...
متن کاملA Theoretical Upper Bound for IP-Based Floorplanning
Floorplan is a crucial estimation task in the modern layout design of systems on chips. The paper presents a novel theoretical upper bound for slicing floorplans with soft modules. We show that, given a set of soft modules of total area Atotal, maximum area Amax, and shape flexibility r ≥ 2.25, there exists a slicing floorplan F of these modules such that Area(F)≤ min{1.131,(1+β)}Atotal , where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. on CAD of Integrated Circuits and Systems
دوره 20 شماره
صفحات -
تاریخ انتشار 2001